package codetop.microsoft.T48;

/**
 * @Author: 18362
 * @Create: 2022-08-13 20:40:09 星期六
 */
class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for (int i=0; i<n/2; ++i) {
            for (int j=i; j+i<n-1; ++j) {
                int temp = matrix[n-1-j][i];
                matrix[n-1-j][i] = matrix[n-1-i][n-1-j];
                matrix[n-1-i][n-1-j] = matrix[j][n-1-i];
                matrix[j][n-1-i] = matrix[i][j];
                matrix[i][j] = temp;
            }
        }
    }
}
